منابع مشابه
k-colored Point-set Embeddability of Outerplanar Graphs
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, · · · , Vk−1, and k disjoint sets S0, · · · , Sk−1 of points in the plane with |Vi| = |Si| (i ∈ {0, · · · , k − 1}). The desired output is a planar drawing such that the vertices of Vi are mapped onto the points of ...
متن کاملA Universal Point Set for 2-Outerplanar Graphs
A point set S ⊆ R is universal for a class G if every graph of G has a planar straight-line embedding on S. It is well-known that the integer grid is a quadratic-size universal point set for planar graphs, while the existence of a sub-quadratic universal point set for them is one of the most fascinating open problems in Graph Drawing. Motivated by the fact that outerplanarity is a key property ...
متن کاملPathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [2], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant c such that the pathwidth of every biconnected...
متن کاملSHOX point mutations and deletions in Leri-Weill dyschondrosteosis.
C Falcinelli, L Iughetti, A Percesepe, G Calabrese, F Chiarelli, M Cisternino, L De Sanctis, I Pucarelli, G Radetti, M Wasniewska, G Weber, L Stuppia, S Bernasconi, A Forabosco . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملEnumeration of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time, and gn is asymptotically g n −5/2 ρ , where g ≈ 0.00909941 and ρ ≈ 7.50360 can be approximated. Using our enumerative results we investigate several statistical properties of random unlabeled outerplanar graphs on n v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1976
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90001-0